Skip to main content
ICT
Lesson A18 - Merge and MergeSort
 
Main Previous Next
Title Page >  
Summary >  
Lesson A1 >  
Lesson A2 >  
Lesson A3 >  
Lesson A4 >  
Lesson A5 >  
Lesson A6 >  
Lesson A7 >  
Lesson A8 >  
Lesson A9 >  
Lesson A10 >  
Lesson A11 >  
Lesson A12 >  
Lesson A13 >  
Lesson A14 >  
Lesson A15 >  
Lesson A16 >  
Lesson A17 >  
Lesson A18 >  
Lesson A19 >  
Lesson A20 >  
Lesson A21 >  
Lesson A22 >  
Lesson AB23 >  
Lesson AB24 >  
Lesson AB25 >  
Lesson AB26 >  
Lesson AB27 >  
Lesson AB28 >  
Lesson AB29 >  
Lesson AB30 >  
Lesson AB31 >  
Lesson AB32 >  
Lesson AB33 >  
Vocabulary >  
 

LAB ASSIGNMENT A18.1 page 8 of 9

Merge

Assignment:

  1. As explained in the student lesson, write a method to merge two sorted lists into one sorted list.

  2. Add the code for your merge method to the provided starter code merge template, MergeTemplate.java.

Instructions:

  1. The merge algorithm is prone to logic errors. The most common error is dealing with cases when you have reached the end of one list or the other. You are to test these 6 different input scenarios or trials:

     
    List A
    List B
    Quantity
    Largest Value
    Quantity
    Largest Value
             
    Trial 1
    20
    100
    40
    100
    Trial 2
    40
    100
    20
    100
    Trial 3
    20
    100
    40
    50
    Trial 4
    20
    50
    40
    100
    Trial 5
    40
    50
    20
    100
    Trial 6
    40
    100
    20
    50

  2. Turn in your source code and the printed run output for trials 4 and 6. If possible, print only the merge function source code.

 

Main Previous Next
Contact
 © ICT 2006, All Rights Reserved.